Linear Realizability
نویسنده
چکیده
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also define a category of assemblies as well as a category of modest sets which are realized by rLCA. This is a linear style of realizability in a way that duplicating and discarding of realizers is allowed in a controlled way. Both categories form linear-non-linear models and their coKleisli categories have a natural number object. We construct some examples of rLCA’s which have some relations to well known PCA’s.
منابع مشابه
Quantitative classical realizability
Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functions are interpreted as bounded time computable functions. It has been used to give new and uniform proofs of soundness of several type systems with respect to certain time complexity classes. We propose a reformulation...
متن کاملTowards a Complexity-through-Realizability Theory
We explain how recent developments in the fields of realizability models for linear logic [Sei14e] – or geometry of interaction – and implicit computational complexity [AS14, AS15] can lead to a new approach of implicit computational complexity. This semantic-based approach should apply uniformly to various computational paradigms, and enable the use of new mathematical methods and tools to att...
متن کاملProcess Realizability
We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.
متن کاملRealizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named d`PCF as a framework for implicit computational complexity. d`PCF is a non-standard type system for PCF programs which is relatively complete with respect to complexity properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quan...
متن کاملProof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modified realizability, namely modified realizability with truth and q-modified realizability. Both variants are shown to be derived from a single “functional interpretation with truth” of intuitionistic linear logic. This analys...
متن کاملRealizability models for BLL-like languages
We give a realizability model of Girard-Scedrov-Scott’s Bounded Linear Logic (BLL). This gives a new proof that all numerical functions representable in that system are polytime. Our analysis naturally justifies the design of the BLL syntax and suggests further extensions.
متن کامل